The Clique - PDFSEARCH.IO - Document Search Engine

The Clique
Results: 193

#	Item
11	MCS 401 – Computer Algorithms I Spring 2016 Problem Set 4 Lev Reyzin Due: by the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-03-11 11:13:37 Graph theory NP-complete problems Pathwidth Clique problem
12	MEDIA KIT: Q1 FY17  Disrupting the print DNA with fashion magazine style, quality content, 100% digital Add to Reading List Source URL: files.alluremedia.com.au Language: English - Date: 2016-07-23 03:38:31 Business World Wide Web Economy ComScore Google Analytics Analytics Google Clique
13	k-core decomposition: a tool for the visualization of large scale networks Ignacio Alvarez-Hamelina , Luca Dall’Astaa , Alain Barrata and Alessandro Vespignanib a LPT (UMR du CNRS 8627), Universit´e de Paris-Sud, 914 Add to Reading List Source URL: arxiv.org Language: English - Date: 2016-08-16 07:40:22 Graph theory Degeneracy Vertex Connectivity Graph Centrality Ear decomposition Directed graph Neighbourhood Degree HCS clustering algorithm Clique percolation method
14	Algebraic Methods in the Congested Clique∗ † Keren Censor-Hillel Technion Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:11 Network theory NP-complete problems Edsger W. Dijkstra Graph coloring Spanning tree Matching Shortest path problem Logical matrix Treewidth Matrix Minimum spanning tree Clique
15	CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-06-04 09:49:43 Coding theory Error detection and correction Expander code Expander graph Linear code Hamming Isoperimetric inequality Connectivity Clique Forward error correction Graph Bipartite graph
16	A Description-driven Community Detection SIMON POOL, Universiteit Utrecht, the Netherlands FRANCESCO BONCHI, Yahoo! Research Barcelona, Spain MATTHIJS VAN LEEUWEN, KU Leuven, Belgium Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2014-12-31 10:52:18 Graph theory Graph partition Graph Line graph Clique Connectivity Vertex Clique percolation method Median graph
17	New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Trapezoid graph Interval graph Independent set Clique Matching Intersection graph Comparability graph Chordal graph Trivially perfect graph Interval scheduling
18	Colouring Graphs When the Number of Colours is Almost the Maximum Degree∗ Michael Molloy Dept of Computer Science, University of Toronto 10 Kings College Rd. Toronto, ON, Canada, M5S 3G4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-01-05 22:31:04 Graph coloring Graph theory Graph operations Clique Degree Neighbourhood Graph Perfect graph theorem Extremal graph theory
19	On the Recognition of Four-Directional Orthogonal Ray Graphs∗ Stefan Felsner1 , George B. Mertzios2 , and Irina Mustat, ˘a1 1 2 Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-06-11 12:17:55 Graph Graph theory Ear decomposition Clique Intersection graph Comparability graph Orientation Line graph Interval graph
20	Which cliques? • In general, an undirected model can place potentials on any subset of the cliques of the graph. Lecture 11: Iterative Proportional Fitting Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-10-06 18:57:16 Statistical theory Estimation theory XC KullbackLeibler divergence Cross entropy Clique Maximum likelihood estimation

UPDATE